Conceptual Models for Combined Planning and Scheduling
نویسنده
چکیده
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Programming joined their power to tackle the problems brought by real industrial life. Among them Constraint Programming plays the integrating role because it provides nice declarative capabilities for modelling and, at the same time, it can exploit directly the successful methods developed in AI and OR. In this paper we analyse the problems behind industrial planning and scheduling. In particular we give a survey of possible conceptual models for scheduling problems with some planning features. We compare their advantages and drawbacks and we explain the industrial background. These models were studied within the VisOpt project whose task is to develop a generic scheduling engine for complex production environments.
منابع مشابه
Exact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment
This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...
متن کاملDynamic Constraint Models for Complex Production Environments
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and scheduling problems are usually solved independently using different methods. Recent development of Constraint Programming brings a new breeze to these areas. It allows using the same techniques for modelling planning an...
متن کاملTwo Mathematical Models for Railway Crew Scheduling Problem
Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new ma...
متن کاملProduction and Operations Management: Models and Algorithms
This chapter intends to give an overview of the literature on dynamic lot-sizing models and stochastic transshipment models. These two types of models are used as a basis for developing models with substitution in the following chapters. Section 2.1 contains a classification of models for dynamic lot-sizing / production planning, and selected models. In Sect. 2.2, we give a brief overview of av...
متن کاملProduction and Operations Management: Models and Algorithms
This chapter intends to give an overview of the literature on dynamic lot-sizing models and stochastic transshipment models. These two types of models are used as a basis for developing models with substitution in the following chapters. Section 2.1 contains a classification of models for dynamic lot-sizing / production planning, and selected models. In Sect. 2.2, we give a brief overview of av...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 4 شماره
صفحات -
تاریخ انتشار 2000